Computing the Discrete Fréchet Distance with Imprecise Input

We consider the problem of computing the discrete Fréchet distance between two polygonal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in arbitrary fixed dimension, we present an algorithm for this problem that returns in time O(mn log(mn)) the Fréchet distance lower bound between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the planar case with running time O(mn log(mn) + (m + n) logmn). In the ddimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L∞ distance, we give an O(dmn log(dmn))-time algorithm.